Lectures on Streaming Algorithms
نویسنده
چکیده
• Standard stream model: m elements from universe of size n, come one by one. Goal: compute a function of stream. Constraints: (1) Limited space (working memory), sublinear in n and m. (2) Access data sequentially. (3) Process each element quickly. • Graph stream: elements of the stream are edges. Let n be the number of vertices. We have m = O(n 2). To be able to handle interesting functions, we typically allow space O(n log O(1) n). • Sliding windows: (1) Sequence-based sliding window: only interested in the last w elements. (2) Time-based sliding window: only interested in elements that arrive in the last w time steps.
منابع مشابه
CMSC 858F: Algorithmic Lower Bounds: Fun with Hardness Proofs Fall 2014 Introduction to Streaming Algorithms
In the previous lectures, we looked at the online algorithms and studies some of the related problems. Now we look into streaming algorithms, which have many similarities with online algorithm. They both require decisions before seeing all data but streaming algorithms can defer actions with limited memory. In these two lectures, we introduce streaming algorithms, related communication complexi...
متن کاملHybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage
In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...
متن کاملMassachusetts Institute of Technology Lecturer : Piotr Indyk 6 . 895 : Sketching , Streaming and Sub - linear Space Algorithms
In previous lectures, we have seen streaming algorithms that operate a number of different data types, including numerical, metric, and geometric. Today we will investigate streaming algorithms on graphs. Our model for graph data will be as follows. Given a graph G = (V,E) with |V | = n, we will assume that V is known, and that the edges in E are revealed in arbitrary order (deletions are not s...
متن کاملLot Streaming in No-wait Multi Product Flowshop Considering Sequence Dependent Setup Times and Position Based Learning Factors
This paper considers a no-wait multi product flowshop scheduling problem with sequence dependent setup times. Lot streaming divide the lots of products into portions called sublots in order to reduce the lead times and work-in-process, and increase the machine utilization rates. The objective is to minimize the makespan. To clarify the system, mathematical model of the problem is presented. Sin...
متن کاملModelling and Scheduling Lot Streaming Flexible Flow Lines
Although lot streaming scheduling is an active research field, lot streaming flexible flow lines problems have received far less attention than classical flow shops. This paper deals with scheduling jobs in lot streaming flexible flow line problems. The paper mathematically formulates the problem by a mixed integer linear programming model. This model solves small instances to optimality. Moreo...
متن کاملWebcast and Distributed Collaboration Control Automation
This proposed research will design, implement and test algorithms to automate the production of webcasts and distributed collaborations using Internet multicast streaming media technologies. We have considerable experience producing webcasts for seminars, workshops, special events, and class lectures. We have also produced videoconferences using Internet Mbone and Access Grid (AG) technologies....
متن کامل